A stochastic dynamic program for the single-day surgery scheduling problem
نویسندگان
چکیده
منابع مشابه
A stochastic dynamic program for the single-day surgery scheduling problem
The scheduling of individual surgical patients has received extensive treatment in the literature, but this paper is the first to propose a model that simultaneously captures the roles of block schedules, block release dates, and request queue policies in the dynamic evolution of the schedule for a single day in an operating room suite. The model is formulated as a stochastic dynamic program an...
متن کاملA stochastic model for project selection and scheduling problem
Resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. In this study, budget, investment costs and earnings are considered to be stochastic. The objectives are maximizing net present values of selected projects and minimizing v...
متن کاملa stochastic model for project selection and scheduling problem
resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. in this study, budget, investment costs and earnings are considered to be stochastic. the objectives are maximizing net present values of selected projects and minimizing v...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics
Scheduling elective surgeries is a dynamic, sequential decision-making 1 process that must balance the costs of deferring waiting cases and blocking higher2 priority cases. Although other surgery scheduling problems have received extensive 3 treatment in the literature, this paper presents the first single-day scheduling problem 4 formulation to capture this aspect of the scheduling process whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions on Healthcare Systems Engineering
سال: 2011
ISSN: 1948-8300,1948-8319
DOI: 10.1080/19488300.2011.628638